Full classification of permutation rational functions and complete rational functions of degree three over finite fields

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Art of Iterating Rational Functions over Finite Fields

The field of complex dynamical systems generated by iteration of polynomials and rational functions is a classical area of mathematics with a rich history and a wide variety of results. Recently, there has been substantial interest in arithmetical dynamical systems (ADS), meaning the iteration of rational functions over fields of number-theoretic interest. Although isolated results regarding AD...

متن کامل

Generalization of Gabidulin Codes over Fields of Rational Functions

Abstract— We transpose the theory of rank metric and Gabidulin codes to the case of fields which are not finite fields. The Frobenius automorphism is replaced by any element of the Galois group of a cyclic algebraic extension of a base field. We use our framework to define Gabidulin codes over the field of rational functions using algebraic function fields with a cyclic Galois group. This gives...

متن کامل

Constructing Permutation Rational Functions From Isogenies

A permutation rational function f ∈ Fq(x) is a rational function that induces a bijection on Fq, that is, for all y ∈ Fq there exists exactly one x ∈ Fq such that f(x) = y. Permutation rational functions are intimately related to exceptional rational functions, and more generally exceptional covers of the projective line, of which they form the first important example. In this paper, we show ho...

متن کامل

Periods of Iterated Rational Functions over a Finite Field

If f is a polynomial of degree d in Fq[x], let ck(f) be the number of cycles of length k in the directed graph on Fq with edges {(v, f(v))}v∈Fq . For random polynomials, the numbers ck, 1 ≤ k ≤ b, have asymptotic behavior resembling that for the cycle lengths of random functions f : [q] → [q]. However random polynomials differ from random functions in important ways. For example, given the set ...

متن کامل

Motifs, L-Functions, and the K-Cohomology of Rational Surfaces over Finite Fields

Let X be a smooth projective variety over a field. Let ~f~ denote the Zariski sheaf associated to the presheaf U ~-, Kj(F(U, Cv)) of Quillen K-groups. The collection of Zariski cohomology groups H~(X, ~Fj) will be referred to as the K-cohomology of X. The groups contain a great deal of information about the geometry of X. For example, Bloch's formula [11] says that Hi(X, ~ ) is isomorphic to th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Designs, Codes and Cryptography

سال: 2020

ISSN: 0925-1022,1573-7586

DOI: 10.1007/s10623-020-00715-0